Approximation algorithms for inventory problems with submodular or routing costs
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Inventory Problems with Submodular or Routing Costs
We consider the following two deterministic inventory optimization problems over a finite planning horizon T with non-stationary demands. • Submodular Joint Replenishment Problem. This involves multiple item types and a single retailer who faces demands. In each time step, any subset of item-types can be ordered incurring a joint ordering cost which is submodular. Moreover, items can be held in...
متن کاملApproximation Algorithms for Capacitated Stochastic Inventory Systems with Setup Costs
We develop the first approximation algorithm with worst-case performance guarantee for capacitated stochastic periodic-review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near-optimal control policies has been an open challenge. In thi...
متن کاملApproximation Algorithms for Perishable Inventory Systems with Setup Costs
We develop the first approximation algorithm for periodic-review perishable inventory systems with setup costs. The ordering lead time is zero. The model allows for correlated demand processes which generalize the well-known approaches to model dynamic demand forecast updates. The structure of optimal policies for this fundamental class of problems is not known in the literature. Thus, finding ...
متن کاملApproximation algorithms for some vehicle routing problems
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is either to minimize the total distance traveled by vehicles or to minimize the number of vehicles used. We design constant differential approximation algorithms for kVRP. Note that, using the differential bound for Metric 3VRP, we obtain the randomized standa...
متن کاملApproximation Algorithms for Multi-index Transportation Problems with Decomposable Costs
The axial multi-index transportation problem is defined as follows. Given are k sets A,, each set having n, elements, r = 1,. , k. The Cartesian product of the sets A, is denoted by A. To each element a E A a certain cost, c, E R, is associated. Further, a nonnegative demand e,; is associated to each set Ari = {u E A : u(r) = i}. The problem is to find nonnegative real numbers x0 such that each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2016
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-016-0981-y